Constructions of MDS-convolutional codes - Information Theory, IEEE Transactions on
نویسندگان
چکیده
Maximum-distance separable (MDS) convolutional codes are characterized through the property that the free distance attains the generalized Singleton bound. The existence of MDS convolutional codes was established by two of the authors by using methods from algebraic geometry. This correspondence provides an elementary construction of MDS convolutional codes for each rate and each degree . The construction is based on a well-known connection between quasi-cyclic codes and convolutional codes.
منابع مشابه
Constructions of MDS-convolutional codes
Maximum-distance separable (MDS) convolutional codes are characterized through the property that the free distance attains the generalized singleton bound. The existence of MDS convolutional codes was established by two of the authors by using methods from algebraic geometry. This correspondence provides an elementary construction of MDS convolutional codes for each rate k/n and each degree δ. ...
متن کاملOn Classical and Quantum MDS-Convolutional BCH Codes
Several new families of multi-memory classical convolutional Bose-Chaudhuri-Hocquenghem (BCH) codes as well as families of unit-memory quantum convolutional codes are constructed in this paper. Our unit-memory classical and quantum convolutional codes are optimal in the sense that they attain the classical (quantum) generalized Singleton bound. The constructions presented in this paper are perf...
متن کاملConstruction results for MDS-convolutional codes - International Symposium on Information Theory, 2000. Proceedings. IEEE
The generalized Singleton bound and MDS-convolutional codes are reviewed. For each n, k and 6 an elementary construction of rate k / n MDS convolutional codes of degree 6 is given.
متن کاملConvolutional Code Constructions Resulting in Maximal or near Maximal Free Distance - Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
In this paper we discuss an upper bound on the free distance for a rate k / n convolutional code with complexity b . Using th i s bound we in t roduce the notion of a MDS convolutional code. We also give an algebraic way of cons t ruc t ing b inary codes of rate 1/2 and large complexity. The obta ined distances compare favorably to the distances found by computer searches and probabilistic meth...
متن کاملOn Behaviors and Convolutionail Codes
It is well known that a convolutional code is essentially a linear system defined over a finite field. In this paper we elaborate on this connection. We define a convolutional code as the dual of a complete linear behavior in the sense of Willems (1979). Using ideas from systems theory, we describe a set of generalized first-order descriptions for convolutional codes. As an application of these...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001